Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time
نویسندگان
چکیده
A graph is componentwise biconnected if every connected component either is an isolated vertex or is biconnected. We present a linear-time algorithm for the problem of adding the smallest number of edges to make a bipartite graph componentwise biconnected while preserving its bipartiteness. This algorithm has immediate applications for protecting sensitive information in statistical tables.
منابع مشابه
Kernelization and Complexity Results for Connectivity Augmentation Problems
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivity or biconnectivity. We show that, for bridge-connectivity and biconnectivity, the respective connectivity augmentation problems admit problem kernels with O(k) vertices and links. Moreover, we study partial connectiv...
متن کاملSimpler Sequential and Parallel Biconnectivity Augmentation
For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components and a minimum vertex separator is a vertex separator of least cardinality. The vertex connectivity refers to the size of a minimum vertex separator. For a connected graph G with vertex connectivity k (k ≥ 1), the connectivity augmentation refers to a set S of edges whose augmentation toG...
متن کاملIDEALS WITH (d1, . . . , dm)-LINEAR QUOTIENTS
In this paper, we introduce the class of ideals with $(d_1,ldots,d_m)$-linear quotients generalizing the class of ideals with linear quotients. Under suitable conditions we control the numerical invariants of a minimal free resolution of ideals with $(d_1,ldots,d_m)$-linear quotients. In particular we show that their first module of syzygies is a componentwise linear module.
متن کاملA Polyhedral Approach to Planar Augmentation and Related Problems
Given a planar graph G the planar biconnectivity augmen tation problem is to add the minimum number of edges to G such that the resulting graph is still planar and biconnected Given a nonplanar and biconnected graph the maximum planar biconnected subgraph problem consists of removing the minimum number of edges so that planarity is achieved and biconnectivity is maintained Both problems are imp...
متن کاملA Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation
For a connected graph, a subset of vertices of least size whose deletion increases the number of connected components is the vertex connectivity of the graph. A graph with vertex connectivity k is said to be k-vertex connected. Given a k-vertex connected graph G, vertex connectivity augmentation determines a smallest set of edges whose augmentation to G makes it (k + 1)-vertex connected. In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 19 شماره
صفحات -
تاریخ انتشار 2005